On a method for XML Schema matching
نویسنده
چکیده
In this paper a schema is represented using schema trees. Structural matching is performed by matching the local vicinity of each vertex in a schema tree to the vicinity of each vertex in another schema tree using edit distance. A simulated authority is used to determine the quality of the matches by the matcher. The results show that structure indeed plays a role in matching and demonstrate that the method has potential. It produces more effective mappings for larger vicinities, though at the expense of the efficiency.
منابع مشابه
Management of Xml Data by Means of Schema Matching
The eXtensible Markup Language (XML) has emerged as a de facto standard to represent and exchange information among various applications on the Web and within organizations due to XML’s inherent data self-describing capability and flexibility of organizing data. As a result, the number of available (heterogeneous) XML data is rapidly increasing, and the need for developing high-performance tech...
متن کاملImproving Real World Schema Matching with Decomposition Process
This paper tends to provide an answer to a difficult problem: Matching large XML schemas. Scalable Matching acquires a long execution time other than decreasing the quality of matches. In this paper, we propose an XML schema decomposition approach as a solution for large schema matching problem. The presented approach identifies the common structures between and within XML schemas, and decompos...
متن کاملAn Experiment on the Matching and Reuse of XML Schemas
XML Schema is becoming an indispensable component in developing web applications. With its widespread adoption and its web accessibility, XML Schema reuse is becoming imperative. To support XML Schema reuse, the first step is to develop mechanism to search for relevant XML Schemas over the web. This paper describes a XML Schema matching system that compares two XML Schemas. Our matching system ...
متن کاملApproximate Common Structures in XML Schema Matching1
This paper describes a matching algorithm that can find accurate matches and scales to large XML Schemas with hundreds of nodes. We model XML Schemas as labeled, unordered and rooted trees, and turn the schema matching problem into a tree matching problem. We develop a tree matching algorithm based on the concept of Approximate Common Structures. Compared with the tree edit-distance algorithm a...
متن کاملMDSM: Microarray database schema matching using the Hungarian method
Current microarray databases use different terminologies and structures and thereby limit the sharing of data and collating of results between laboratories. Consequently, an effective integrated microarray data model is required. One important process to develop such an integrated database is schema matching. In this paper, we propose an effective schema matching approach called MDSM, to syntac...
متن کامل